Simultaneous Job Scheduling and Resource Allocation on Parallel Machines
نویسنده
چکیده
Most deterministic machine scheduling models assume that the processing time of a job on a machine is fixed externally and known in advance of scheduling. However, in most realistic situations, apart from the machines, it requires additional resources to process jobs, and the processing time of a job is determined internally by the amount of the resources allocated. In these situations, both the cost associated with the job schedule and the cost of the resources allocated should be taken into account. Therefore, job scheduling and resource allocation should be carefully coordinated in order to achieve an overall cost-effective schedule. In this paper, we study a parallel-machine scheduling model involving simultaneously job processing and resource allocation. The processing time of a job is non-increasing with the cost of the allocated resources. The objective is to minimize the total cost including the cost measured by a scheduling criterion and the cost of all allocated resources. We consider two particular problems of this model, one with the scheduling criterion being the total weighted completion time, and the other with that being the weighted number of tardy jobs. We develop a column generation based branch and bound method for finding optimal solutions for these NP-hard problems. The method first formulate the problems as set partitioning type formulations, and then solves the resulting formulations exactly by branch and bound. In the branch and bound, linear relaxations of the set partitioning type formulations are decomposed into master problems and single-machine subproblems and solved by a column generation approach. The algorithms designed based on this method are capable of solving the two problems with a medium size to optimality within a reasonable computational time.
منابع مشابه
Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines
m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waitin...
متن کاملAdaptive Scheduling for QoS Virtual Machines under Different Resource Availability—First Experiences
The current trend in CPU design is toward many-core CPUs which will create SMP servers with large numbers of cores and require jobs to be parallel. To provide performance guarantees (QoS) and support functional separation, virtual machines are an important approach in such environments. Very promising for job scheduling in such environments is adaptive scheduling which can adjust sizes of paral...
متن کاملComparative Study on Parallel Data Processing for Resource Allocation in Cloud Computing
–Parallel data processing in cloud has emerged to be one killer application for infrastructure as service to integrate framework for products like portfolio, access these services and deploys the program. Scheduling job process in cloud computing for parallel data processing framework is Nephele. Our analysis presents expected performance of parallel job processing. Nephele is the processing fr...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملDesign of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 129 شماره
صفحات -
تاریخ انتشار 2004